DBFW: A Simple DataBase FrameWork for the Evaluation and Maintenance of Automated Theorem Prover Data
نویسندگان
چکیده
This paper describes a simple yet generic database implementation framework for medium sized datasets, as they occur during tests and applications of automated theorem provers. The implementation covers automatic extraction of database objects from a set of text les, a text-based interface for simple database operations, and a tool for document, report and Webpage generation. This paper refers to a database of SETHEO proof data (Setheodb) as an example. It concludes with the description of DBFW as a part of the interactive proof system ILF 2].
منابع مشابه
A Practical Self-Assessment Framework for Evaluation of Maintenance Management System based on RAMS Model and Maintenance Standards
A set of technical, administrative and management activities are done in the life cycle of equipment, to be located in good condition and have proper and expected functioning. This is refers to be, maintenance management system (MMS). The framework and models of assessment in order to enhance effectiveness of a MMS could be proposed in two categories: qualitative and quantitative. In this resea...
متن کاملOptimization of the Controlled Evaluation of Closed Relational Queries
For relational databases, controlled query evaluation is an effective inference control mechanism preserving confidentiality regarding a previously declared confidentiality policy. Implementations of controlled query evaluation usually lack efficiency due to costly theorem prover calls. Suitably constrained controlled query evaluation can be implemented efficiently, but is not flexible enough f...
متن کاملAn Engineering Approach to Atomic Transaction Verification: Use of a Simple Object Model to Achieve Semantics-based reasoning at Compile-time
In this paper, we take an engineering approach to atomic transaction verification. We discuss the design and implementation of a verification tool that can reason about the semantics of atomic database operations. To bridge the gap between language design and automated reasoning, we make use of a simple model of objects that imitates the type-tagged memory structure of an implementation. This s...
متن کاملAnalysis and transformation of proof procedures
Automated theorem proving has made great progress during the last few decades. Proofs of more and more diicult theorems are being found faster and faster. However, the exponential increase in the size of the search space remains for many theorem proving problems. Logic program analysis and transformation techniques have also made progress during the last few years and automated theorem proving ...
متن کاملExtensional Reasoning
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers do not take advantage of database query engines and therefore do not routinely leverage that source of power. Extensional Reasoning is a novel approach to automated theorem proving where the system automatically trans...
متن کامل